Costly Search and Design

نویسندگان

  • Heski Bar-Isaac
  • Guillermo Caruana
  • Vicente Cuñat
چکیده

Firms compete by choosing both a price and a design from a family of designs that can be represented as demand rotations. Consumers engage in costly sequential search among …rms. Each time a consumer pays a search cost he observes a new o¤ering. An o¤ering consists of a price quote and a new good, where goods might vary in the extent to which they are good matches for the consumer. In equilibrium, only two designstyles arise: either the most niche where consumers are likely to either love or loathe the product, or the broadest where consumers are likely to have similar valuations. In equilibrium, di¤erent …rms may simultaneously o¤er both design-styles. We perform comparative statics on the equilibrium and show that a fall in search costs can lead to higher industry prices and pro…ts and lower consumer surplus. Our analysis is related to discussions of how the internet has led to the prevalence of niche goods and the "long tail" phenomenon. Contact info: Bar-Isaac: [email protected]; Department of Economics, Stern School of Business, NYU, 44 West 4th street 7-73, NYC, NY 10012 USA; Caruana: caruana@cem….es; Casado del Alisal 5, 28014 Madrid, Spain; and Cuñat: [email protected], Room A450, Department of Finance, London School of Economics, Houghton Street, London WC2A 2AE, U.K.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Index Structure for Multi-key Search

The linear storage model is widely used to support inmemory multi-key search running on small devices of limited computing capacity, simply because it avoids the maintenance of space-costly and energy-costly indexing structures. However, it only supports sequential multi-key scan which is slow and energy-consuming. We design an index structure called D-Tree to address the problem.

متن کامل

A HYBRID CHARGED SYSTEM SEARCH - FIREFLY ALGORITHM FOR OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...

متن کامل

The Integrated Supply Chain of After-sales Services Model: A Multi-objective Scatter Search Optimization Approach

Abstract: In recent decades, high profits of extended warranty have caused that third-party firms consider it as a lucrative after-sales service. However, customers division in terms of risk aversion and effect of offering extended warranty on manufacturers’ basic warranty should be investigated through adjusting such services. Since risk-averse customers welcome extended warranty, while the cu...

متن کامل

PARTICLE SWARM-GROUP SEARCH ALGORITHM AND ITS APPLICATION TO SPATIAL STRUCTURAL DESIGN WITH DISCRETE VARIABLES

Based on introducing two optimization algorithms, group search optimization (GSO) algorithm and particle swarm optimization (PSO) algorithm, a new hybrid optimization algorithm which named particle swarm-group search optimization (PS-GSO) algorithm is presented and its application to optimal structural design is analyzed. The PS-GSO is used to investigate the spatial truss structures with discr...

متن کامل

OPTIMAL DESIGN OF SINGLE-LAYER BARREL VAULT FRAMES USING IMPROVED MAGNETIC CHARGED SYSTEM SEARCH

The objective of this paper is to present an optimal design for single-layer barrel vault frames via improved magnetic charged system search (IMCSS) and open application programming interface (OAPI). The IMCSS algorithm is utilized as the optimization algorithm and the OAPI is used as an interface tool between analysis software and the programming language. In the proposed algorithm, magnetic c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009